'

Prove that if a graph G = (V,E) is connected, then log |E| = BigO(log |V|).

Need help with this question. Please include explanations and full solution. Thanks in advance!